Component trees for image sequences and streams
نویسندگان
چکیده
منابع مشابه
Edge-based Component-Trees for Multi-Channel Image Segmentation
We introduce the concept of edge-based component-trees for images with an arbitrary number of channels. The approach is a natural extension of the classical component-tree devoted to gray-scale images. The similar structure enables the translation of many gray-level image processing techniques based on the componenttree to hyperspectral and color images. As an example application, we present an...
متن کاملMining Techniques for Data Streams and Sequences
OF THE DISSERTATION Mining Techniques for Data Streams and Sequences
متن کاملQuantitative Comparison of Tree Pairs Resulted from Gene and Protein Phylogenetic Trees for Sulfite Reductase Flavoprotein Alpha-Component and 5S rRNA and Taxonomic Trees in Selected Bacterial Species
Introduction: FAD is the cofactor of FAD-FR protein family. Sulfite reductase flavoprotein alpha-component is one of the main enzymes of this family. Based on applications of this enzyme in biotechnology and industry, it was chosen as the subject of evolutionary studies in 19 specific species. Method: Gene and protein sequences of sulfite reductase flavoprotein alpha-component, 5S rRNA sequence...
متن کاملQuantitative Comparison of Tree Pairs Resulted from Gene and Protein Phylogenetic Trees for Sulfite Reductase Flavoprotein Alpha-Component and 5S rRNA and Taxonomic Trees in Selected Bacterial Species
Introduction: FAD is the cofactor of FAD-FR protein family. Sulfite reductase flavoprotein alpha-component is one of the main enzymes of this family. Based on applications of this enzyme in biotechnology and industry, it was chosen as the subject of evolutionary studies in 19 specific species. Method: Gene and protein sequences of sulfite reductase flavoprotein alpha-component, 5S rRNA sequence...
متن کاملLevel number sequences for trees
This paper concerns some statistical properties of a parameter related to the profiles of binary trees. Define the level of a node v in a rooted tree t as the number of nodes on the branch connecting v to the root of t (counting both end nodes). The level number sequence of a tree t is the infinite sequence of integers (nl, n2, • • .) such that nj is the number of nodes at level j in tree t. Wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition Letters
سال: 2020
ISSN: 0167-8655
DOI: 10.1016/j.patrec.2019.11.038